Connes ’ embedding problem and Tsirelson ’ s problem

نویسندگان

  • C. Palazuelos
  • D. Perez-Garcia
  • V. B. Scholz
  • R. F. Werner
چکیده

We show that Tsirelson’s problem concerning the set of quantum correlations and Connes’ embedding problem on finite approximations in von Neumann algebras (known to be equivalent to Kirchberg’s QWEP conjecture) are essentially equivalent. Specifically, Tsirelson’s problem asks whether the set of bipartite quantum correlations generated between tensor product separated systems is the same as the set of correlations between commuting C*-algebras. Connes’ embedding problem asks whether any separable II1 factor is a subfactor of the ultrapower of the hyperfinite II1 factor. We show that an affirmative answer to Connes’ question implies a positive answer to Tsirelson’s. Conversely, a positve answer to a matrix valued version of Tsirelson’s problem implies a positive one to Connes’ problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computability and the Connes Embedding Problem

The Connes Embedding Problem (CEP) asks whether every separable II1 factor embeds into an ultrapower of the hyperfinite II1 factor. We show that the CEP is equivalent to the statement that every type II1 tracial von Neumann algebra has a computable universal theory.

متن کامل

Algebraic reformulation of Connes embedding problem and the free group algebra

We give a modification of I. Klep and M. Schweighofer algebraic reformulation of Connes’ embedding problem by considering ∗-algebra of the countably generated free group. This allows to consider only quadratic polynomials in unitary generators instead of arbitrary polynomials in self-adjoint generators.

متن کامل

A Computability-theoretic Reformulation of the Connes Embedding Problem

The Connes Embedding Problem (CEP) asks whether every separable II1 factor embeds into an ultrapower of the hyperfinite II1 factor. We show that the CEP is equivalent to the computability of the universal theory of every type II1 von Neumann algebra. We also derive some further computability-theoretic consequences of the CEP.

متن کامل

A Gentle Introduction to Von Neumann Algebras for Model Theorists

1. Topologies on B(H) and the double commutant theorem 2 2. Examples of von Neumann algebras 5 2.1. Abelian von Neumann algebras 6 2.2. Group von Neumann algebras and representation theory 6 2.3. The Hyperfinite II1 factor R 9 3. Projections, Type Classification, and Traces 10 3.1. Projections and the spectral theorem 10 3.2. Type classification of factors 12 3.3. Traces 13 4. Tracial ultrapowe...

متن کامل

About the Connes Embedding Conjecture

In his celebrated paper in 1976, A. Connes casually remarked that any finite von Neumann algebra ought to be embedded into an ultraproduct of matrix algebras, which is now known as the Connes embedding conjecture or problem. This conjecture became one of the central open problems in the field of operator algebras since E. Kirchberg’s seminal work in 1993 that proves it is equivalent to a variet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010